#include <iostream>
#include <algorithm>
#include <string.h>
#include <set>
using namespace std;
int n;
int a[100005];
multiset<int> st;
int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++) {
        if (st.size() && *st.begin() < a[i]) 
            st.erase(st.begin());
        st.insert(a[i]);
    }
    cout << st.size() << "\n";
    return 0;
}